/**
 * Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
 * Note:
 * 		The number of elements initialized in nums1 and nums2 are m and n respectively.
 * 		You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
 */

/**
 * @param {number[]} nums1
 * @param {number} m
 * @param {number[]} nums2
 * @param {number} n
 * @return {void} Do not return anything, modify nums1 in-place instead.
 */
const merge = function (nums1, m, nums2, n) {
	for (let i = m, j = 0; i < nums1.length || j < n; i++, j++) {
		nums1[i] = nums2[j];
	}
	nums1.sort((a, b) => a - b);
};

/**
 * @param {number[]} nums
 */
const bubbleSort = function (nums) {
	let len = nums.length;
	for (let i = 0; i < len - 1; i++) {
		for (let j = i; j < len - i - 1; j++) {
			if (nums[j] > nums[j + 1]) {
				let temp = nums[j];
				nums[j] = nums[j + 1];
				nums[j + 1] = temp;
			}
		}
	}
};
